Arithmetic coding for finite-state noiseless channels
نویسندگان
چکیده
منابع مشابه
Arithmetic coding for finite-state noiseless channels
We analyze the expected delay for infinite precision arithmetic codes, and suggest a practical implementation that closely approximates the idealized infinite precision model.
متن کاملArithmetic Coding for Noisy Channels
Arithmetic Coding is generalized to provide a method for transforming source output se quences into sequences whose probability distribution approaches any desired probability distribution. A further modi cation in which gaps are introduced be tween source intervals allows arithmetic encoders to produce code sequences with any information rate, enabling the encoder to perform joint source-cha...
متن کاملCapacity, mutual information, and coding for finite-state Markov channels
The Finite-State Markov Channel (FSMC) is a discrete time-varying channel whose variation is determined by a finite-state Markov process. These channels have memory due to the Markov channel variation. We obtain the FSMC capacity as a function of the conditional channel state probability. We also show that for i.i.d. channel inputs, this conditional probability converges weakly, and the channel...
متن کاملFinite-state differential coding for wireless communications with multipath channels
Differential coding allows signal demodulation without carrier phase estimation, and thus is commonly used to cope with phase ambiguity and residual carriers. In a wireless scenario where the system transfer function is FIR due to multipath reflections, channel estimation and equalization is usually required. Inspired by the recent work by Tong [1] on blind sequence estimation, we propose a vec...
متن کاملFinite-state adaptive block to variable-length noiseless coding of a nonstationary information source
1259 Ahsfracf-We associate with a given nonstationary finite-alphabet information source a certain class of stationary processes which we term the stationary hull of the given source. It is then shown that the optimum average rate at which the given source can be noiselessly coded via finite-state adaptive block to variable-length coding schemes is the largest entropy rate among those processes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1994
ISSN: 0018-9448
DOI: 10.1109/18.272459